Inversion error, condition number, and approximate inverses of uncertain matrices
نویسنده
چکیده
The classical condition number is a very rough measure of the effect of perturbations on the inverse of a square matrix. First, it assumes that the perturbation is infinitesimally small. Second, it does not take into account the perturbation structure (e.g., Vandermonde). Similarly, the classical notion of the inverse of a matrix neglects the possibility of large, structured perturbations. We define a new quantity, the structured maximal inversion error, that takes into account both structure and non-necessarily small perturbation size. When the perturbation is infinitesimal, we obtain a “structured condition number”. We introduce the notion of approximate inverse, as a matrix that best approximates the inverse of a matrix with structured perturbations, when the perturbation varies in a given range. For a wide class of perturbation structures, we show how to use (convex) semidefinite programming to compute bounds on the structured maximal inversion error and structured condition number, and compute an approximate inverse. The results are exact when the perturbation is “unstructured”—we then obtain an analytic expression for the approximate inverse. When the perturbation is unstructured and additive, we recover the classical condition number; the approximate inverse is the operator related to the Total Least Squares (orthogonal regression) problem. © 2002 Elsevier Science Inc. All rights reserved.
منابع مشابه
A Homotopic/Factorization Process for Toeplitz-like Matrices with Newton’s/Conjugate Gradient Stages
We modify our earlier homotopic process for iterative inversion of Toeplitz and Toeplitz-like matrices to improve the choice of the initial approximate inverses at every homotopic step. This enables us to control the condition of the auxiliary matrices and to accelerate convergence substantially. The algorithm extends our older approach where the input matrix was factorized into the product of ...
متن کاملA proximal approach to the inversion of ill-conditioned matrices
We propose a general proximal algorithm for the inversion of ill-conditioned matrices. This algorithm is based on a variational characterization of pseudo-inverses. We show that a particular instance of it (with constant regularization parameter) belongs to the class of fixed point methods. Convergence of the algorithm is also discussed.
متن کاملUsing approximate inverses in algebraic multilevel methods
This paper deals with the iterative solution of large sparse symmetric positive definite systems. We investigate preconditioning techniques of the two-level type that are based on a block factorization of the system matrix. Whereas the basic scheme assumes an exact inversion of the submatrix related to the first block of unknowns, we analyze the effect of using an approximate inverse instead. W...
متن کاملComputation of Numerical Padé-Hermite and Simultaneous Padé Systems I: Near Inversion of Generalized Sylvester Matrices
Abstract. We present new formulae for the “near” inverses of striped Sylvester and mosaic Sylvester matrices. The formulae assume computation over floating-point rather than exact arithmetic domains. The near inverses are expressed in terms of numerical Padé-Hermite systems and simultaneous Padé systems. These systems are approximants for the power series determined from the coefficients of the...
متن کاملThe Inverse of Covariance Matrices for the Arma (p, Q) Class of Processes
Abstract – Analysis of time series data can involve the inversion of large covariance matrices. For the class of ARMA (p, q) processes there are no exact explicit expressions for these inverses, except for the MA (1) process. In practice, the sample covariance matrix can be very large and inversion can be computationally time consuming and so approximate explicit expressions for the inverse are...
متن کامل